Graph-Theoretic Analysis of Kautz Topology and DHT Schemes
نویسندگان
چکیده
Many proposed distributed hash table (DHT) schemes for peer-topeer network are based on some traditional parallel interconnection topologies. In this paper, we show that the Kautz graph is a very good static topology to construct DHT schemes. We demonstrate the optimal diameter and optimal fault tolerance properties of the Kautz graph and prove that the Kautz graph is (1+o(1))-congestion-free when using the long path routing algorithm. Then we propose FissionE, a novel DHT scheme based on Kautz graph. FissionE is a constant degree, O(logN) diameter and (1+o(1))-congestion-free. FissionE shows that the DHT scheme with constant degree and constant congestion can achieve O(logN) diameter, which is better than the lower bound Ω(N) conjectured before.
منابع مشابه
Efficient range query processing over DHTs based on the balanced Kautz tree
Distributed Hash Tables (DHTs) are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for hosting large-scale distributed applications. The ever-wider use of DHT infrastructures has found more and more applications that require support for range queries. Recently, a number of DHT-based range query schemes have been proposed. However, mo...
متن کاملCayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is commonly recognized that the primary difficulty in designing DHT is not in static DHT topologies, but in the dynamic DHT algorithm which adapts various static DHT topologies to a dynamic network at Internet. As a direct co...
متن کاملDeconstructing DHTs
Nearly all proposed DHTs have echoes – either explicit or implicit – of parallel interconnect networks such as butterfly, torus, hypercube, and de Bruijn graphs. However, unlike interconnection networks, DHTs define an overlay graph for all network sizes, and allow the overlay graph to evolve as nodes join and leave as participants. Most of the well-cited DHT designs obscured two basic concerns...
متن کاملExact annihilating-ideal graph of commutative rings
The rings considered in this article are commutative rings with identity $1neq 0$. The aim of this article is to define and study the exact annihilating-ideal graph of commutative rings. We discuss the interplay between the ring-theoretic properties of a ring and graph-theoretic properties of exact annihilating-ideal graph of the ring.
متن کاملInterconnection networks: graph– and group–theoretic modelling
The present paper surveys recent and promising results about graph–theoretic and group–theoretic modelling in distributed computing. The specific behaviour of various classes of networks (Cayley and Borel Cayley networks, de Bruijn and Kautz networks, etc.) is studied in terms of usual efficiency requirements, such as computability, symmetry, uniformity and algebraic structure, ease of routing,...
متن کامل